Refining cheap-talk equilibria

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Refining Cheap - Talk Equilibria *

Several conceptual points are made concerning communication in games of asymmetric information. Equilibrium refinements of Sender-Receiver cheap-talk games that are based on the concept of a putative equilibrium, and which rely on the presence of a rich language with literal meanings, are discussed. Three nested criteria are proposed: strong announcement-proofness, announcement-proofness, and w...

متن کامل

Selecting Cheap-talk Equilibria Selecting Cheap-talk Equilibria

The copyright to this Article is held by the Econometric Society. It may be downloaded, printed and reproduced only for educational or research purposes, including use in course packs. No downloading or copying may be done for any commercial purpose without the explicit permission of the Econometric Society. For such commercial purposes contact the Office of the Econometric Society (contact inf...

متن کامل

Selecting Cheap-Talk Equilibria∗

There are typically multiple equilibrium outcomes in the Crawford-Sobel (CS) model of strategic information transmission. This paper identifies a simple condition on equilibrium payoffs, called NITS, that selects among CS equilibria. Under a commonly used regularity condition, only the equilibrium with the maximal number of induced actions satisfies NITS. We discuss various justifications for N...

متن کامل

Durable Cheap Talk Equilibria∗

We consider a cheap-talk game with one sender and one receiver. If the receiver does not commit to listen to only one message, the equilibrium refinements due to Farrell [5], Grossman and Perry [7] and Matthews, OkunoFujiwara and Postlewaite [11] are no longer applicable. We discuss different notions of durability and sequential credibility when a message can later be followed by more messages,...

متن کامل

Robust almost fully revealing equilibria in multi-sender cheap talk∗

This paper shows that in multi-sender cheap talk games, if the state space is large enough, then there exist equilibria arbitrarily close to full revelation of the state that are robust to introducing a small amount of noise in the senders’ observations. The result holds irrespectively of the dimensionality of the state space, including for one-dimensional state spaces. We establish the result ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Economic Theory

سال: 1991

ISSN: 0022-0531

DOI: 10.1016/0022-0531(91)90040-b